#include "priority_queue.h"
#include <iostream>
using namespace std;

int main()
{
	vector<int> vec1{ 8,6,3,4,1 };
	zh::priority_queue<int, vector<int>, zh::greater<int>> pri1(vec1.begin(), vec1.end());
	while (!pri1.empty())
	{
		cout << pri1.top() << ' ';
		pri1.pop();
	}
	cout << endl;

	vector<int> vec2{ 5,6,9,4,2 };
	zh::priority_queue<int, vector<int>, zh::greater<int>> pri2(vec2.begin(), vec2.end());
	while (!pri2.empty())
	{
		cout << pri2.top() << ' ';
		pri2.pop();
	}
	cout << endl;
	return 0;
}

